【C++STL】遍历算法(for

cft56200_ln: class Solution { public: vector twoSum(vector& nums, int target) { std::unordered_map myMap; vector result; for(int i = 0; i < nums.size(); i ++) { int complement = target - nums[i]; if (myMap.find(complement) != myMap.end()) { result.push_back(myMap[complement]); result.push_back(i); break; } myMap[nums[i]] = i; } return result; } };